Hardness of Approximation for Strip Packing
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Multiple Strip Packing
In this paper we study the Multiple Strip Packing (MSP) problem, a generalization of the well-known Strip Packing problem. For a given set of rectangles, r1, . . . , rn, with heights and widths ≤ 1, the goal is to find a non-overlapping orthogonal packing without rotations into k ∈ N strips [0, 1]× [0,∞), minimizing the maximum of the heights. We present an approximation algorithm with absolute...
متن کاملHardness of approximation for orthogonal rectangle packing and covering problems
Bansal and Sviridenko [4] proved that there is no asymptotic PTAS for 2-dimensional Orthogonal Bin Packing (without rotations), unless P = NP. We show that similar approximation hardness results hold for several 2and 3-dimensional rectangle packing and covering problems even if rotations by ninety degrees are allowed. Moreover, for some of these problems we provide explicit lower bounds on asym...
متن کاملA (5/3 + ε)-Approximation for Strip Packing
We study strip packing, which is one of the most classical two-dimensional packing problems: given a collection of rectangles, the problem is to find a feasible orthogonal packing without rotations into a strip of width 1 and minimum height. In this paper we present an approximation algorithm for the strip packing problem with absolute approximation ratio of 5/3 + ε for any ε > 0. This result s...
متن کاملImproved Pseudo-Polynomial-Time Approximation for Strip Packing
We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization. Here we are given a set of axis-parallel rectangles in the two-dimensional plane and the goal is to pack them in a vertical strip of fixed width such that the height of the obtained packing is minimized. The packing must be non-overlapping and the rectangles cannot be ro...
متن کاملApproximation algorithms and hardness results for the clique packing problem
For a fixed family F of graphs, an F -packing in a graphG is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F . Finding an F -packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K2}. In this paper we provide new approximation algorithms and hardness results for the Kr-packing probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2017
ISSN: 1942-3454,1942-3462
DOI: 10.1145/3092026